51![A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 ](https://www.pdfsearch.io/img/ebd4432356db16a5edf9c25e0d5ea495.jpg) | Add to Reading ListSource URL: www.cs.tufts.eduLanguage: English - Date: 2012-10-31 09:54:23
|
---|
52![Discrete Mathematics – 43 www.elsevier.com/locate/disc Identifying phylogenetic trees Magnus Bordewicha , Katharina T. Huberb , Charles Semplec a School of Computing, University of Leeds, Leeds LS2 9JT, U Discrete Mathematics – 43 www.elsevier.com/locate/disc Identifying phylogenetic trees Magnus Bordewicha , Katharina T. Huberb , Charles Semplec a School of Computing, University of Leeds, Leeds LS2 9JT, U](https://www.pdfsearch.io/img/eab44ce66372676f1903937cf4b07318.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2006-01-18 08:08:22
|
---|
53![QCSP on partially reflexive forests Barnaby Martin? School of Engineering and Computing Sciences, Durham University Science Labs, South Road, Durham, DH1 3LE, UK QCSP on partially reflexive forests Barnaby Martin? School of Engineering and Computing Sciences, Durham University Science Labs, South Road, Durham, DH1 3LE, UK](https://www.pdfsearch.io/img/d6647bc9c5361bc8400033f716f68081.jpg) | Add to Reading ListSource URL: www.bedewell.comLanguage: English - Date: 2011-04-01 20:03:12
|
---|
54![entropymethodV11-SODA-cameraready.dvi entropymethodV11-SODA-cameraready.dvi](https://www.pdfsearch.io/img/8b91897cee917670aa6961451d5545cf.jpg) | Add to Reading ListSource URL: www.math.washington.eduLanguage: English - Date: 2013-11-01 17:11:52
|
---|
55![](https://www.pdfsearch.io/img/4c018064c108a7b40f570717d07a878b.jpg) | Add to Reading ListSource URL: www-cc.cs.uni-saarland.deLanguage: English - Date: 2014-05-22 04:06:43
|
---|
56![New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ § New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §](https://www.pdfsearch.io/img/d680391bdc7f97710a1dd36f08b8bf8f.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2016-05-11 15:56:58
|
---|
57![METRICALLY HOMOGENEOUS GRAPHS OF DIAMETER THREE DANIELA AMATO, GREGORY CHERLIN, AND H. DUGALD MACPHERSON Abstract. We classify countable metrically homogeneous graphs of diameter 3. METRICALLY HOMOGENEOUS GRAPHS OF DIAMETER THREE DANIELA AMATO, GREGORY CHERLIN, AND H. DUGALD MACPHERSON Abstract. We classify countable metrically homogeneous graphs of diameter 3.](https://www.pdfsearch.io/img/ad2dc7e0b1f6ea17f9fb8700cb08111b.jpg) | Add to Reading ListSource URL: www1.maths.leeds.ac.ukLanguage: English - Date: 2016-06-30 08:12:01
|
---|
58![3-coloring triangle-free planar graphs with a precolored 8-cycle Zdenˇek Dvoˇra´k ∗ 3-coloring triangle-free planar graphs with a precolored 8-cycle Zdenˇek Dvoˇra´k ∗](https://www.pdfsearch.io/img/27b868489b89428c3e8771f8688f1449.jpg) | Add to Reading ListSource URL: orion.math.iastate.eduLanguage: English - Date: 2014-08-22 14:45:15
|
---|
59![PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic](https://www.pdfsearch.io/img/25249ebc7b6fa1095b01aecd2fa73b4e.jpg) | Add to Reading ListSource URL: www.cs.mun.caLanguage: English - Date: 2015-03-23 10:06:06
|
---|
60![The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ?? The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ??](https://www.pdfsearch.io/img/bbc43bfb7221bff7e537590b44333084.jpg) | Add to Reading ListSource URL: web.cs.du.eduLanguage: English - Date: 2010-11-16 11:14:05
|
---|